Least Squares Fitting of Piecewise Algebraic Curves
نویسندگان
چکیده
A piecewise algebraic curve is defined as the zero contour of a bivariate spline. In this paper, we present a new method for fitting C1 piecewise algebraic curves of degree 2 over type-2 triangulation to the given scattered data. By simultaneously approximating points, associated normals and tangents, and points constraints, the energy term is also considered in the method. Moreover, some examples are presented.
منابع مشابه
A Simple Algorithm for Efficient Piecewise Linear Approximation of Space Curves
An on-line method for piecewise linear approximation of open or closed space curves is described. The algorithm guarantees approximation within a deviation threshold and is offered as an efficient, on-line alternative to the split and merge approach. Other efficient methods operate only on planar curves, whereas the approach we offer is also appropriate for space curves. A simple function of ch...
متن کاملBoundary Estimation from Intensity/Color Images with Algebraic Curve Models
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically to . This boundary-estimation algorithm has the nice properties that it uses all the data in the window and thus can find locally weak boundaries embedded in noise or texture and boundaries when there are more than two regions to be ...
متن کاملA Curve Fitting Algorithm for Character Fonts
This paper presents an algorithm that automatically generates outline fonts from a grey-level image of a character obtained by a scanner. Our algorithm begins by extracting contour points from the image and dividing the points into a number of segments at the corner points. The next step is fitting a piecewise cubic Bézier curve to each segment. To fit cubic Bézier curves to segments, we use le...
متن کاملEfficient piecewise linear approximation of space curves using chord and arc length
abstract An efficient, accurate, and simple method for doing suboptimal piecewise linear approximation of open or closed space curves is described. The algorithm guarantees approximation within a deviation threshold and is offered as an efficient alternative to the popular, but inefficient, split and merge approach. The several efficient alternatives this author encountered are defined only for...
متن کاملLeast Square Based Automatic Threshold Selection for Polygonal Approximation of Digital Curves
Polygonal approximation is a very useful and common representation of digital curves. This application depends on a parameter, which is the threshold value. Various simple piecewise linear curve fitting procedures called the iterative endpoint fit algorithm are available in the literature. The choice of threshold value for convergence of this type of algorithm is a critical point. In this pape...
متن کامل